Partial profiles of quasi-complete graphs
نویسنده
چکیده
We enumerate graph homomorphisms to quasi-complete graphs i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels.
منابع مشابه
P-quasi Complete Linkage Analysis for Gene-Expression Data
In order to find the function of genes from geneexpression profiles, the hierarchical clustering has been used generally. But this method has problems, for example a dendrogram tends to change by data dependence, therefore it is easy to be influenced of the error of an experimental noise. To cope with the problems, we propose another type of clustering. We formulate the problem of the clusterin...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملFast Recognition of Partial Star Products and Quasi Cartesian Products
This paper is concerned with the fast computation of a relation d on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian products, the weak reconstruction of Cartesian products, and the recognition of Cartesian graph bundles with a triangle free basis. A special case of d is the relation δ, whose convex closure yields the product relation σ th...
متن کاملAn upper bound on the sum of squares of degrees in a graph
Let G(v, e) be the set of all simple graphs with v vertices and e edges and let P2(G) = ∑ di denote the sum of the squares of the degrees, d1, . . . , dv, of the vertices of G. It is known that the maximum value of P2(G) for G ∈ G(v, e) occurs at one or both of two special graphs in G(v, e)—the quasi-star graph or the quasi-complete graph. For each pair (v, e), we determine which of these two g...
متن کاملSum of squares of degrees in a graph
Let G(v, e) be the set of all simple graphs with v vertices and e edges and let P2(G) = ∑ d i denote the sum of the squares of the degrees, d1, . . . , dv, of the vertices of G. It is known that the maximum value of P2(G) for G ∈ G(v, e) occurs at one or both of two special graphs in G(v, e)—the quasi-star graph or the quasi-complete graph. For each pair (v, e), we determine which of these two ...
متن کامل